Two more representation problems

A More Precise Solution to Two Problems on Tries ( Preliminary

We use the Binomial Transform to address the problem of determining the average size and leaf depth of a trie. These problems lead to the need to nd the poles of the function 1 1?p s+1 ?q s+1 , which we solve exactly up to low-order terms. This improves previous asymptotic approximations, which although solve the problem to a higher precision, do not allow to compute exact values for the main t...

More Accurate Representation of Conics

A More Compact Visibility Representation

16 4-block tree in linear time. The problem is already linear time solvable in case of 2-and 3-connected components (see e.g., Hopcroft & Tarjan 8]), hence solving this open problem yields a nice generalization. As a last subject we consider the method of triangulating planar graphs. It would be interesting to triangulate G such that it is 4-connected. Indeed, G may have separating triangles, i...

Representation: Problems and Solutions

The current orthodoxy in cognitive science, what I describe as a commitment to deep representationalism, faces intractable problems. If we take these objections seriously, and I will argue that we should, there are two possible responses: 1. We are mistaken that representation is the locus of our cognitive capacities — we manage to be the successful cognitive agents in some other, non-represent...

More problems , Global Alignment

Recall that in biological experiments only relatively short segments of the DNA can be investigated. To investigate the structure of a long DNA molecule, the DNA is broken into smaller fragments that can be studied more easily by biological experiments. For instance, physical mapping aims at ordering these fragments based on overlap information obtained from hybridization experiments with a set...